Interactive Algorithms 2005 Yuri Gurevich Microsoft Research
نویسنده
چکیده
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choice. Similarly, an object-oriented program cannot create a new object all by itself; a create-a-new-object command solicits outside help. These are but two examples of intrastep interaction of an algorithm with its environment. Here we motivate and survey recent work on interactive algorithms within the Behavioral Computation Theory project.
منابع مشابه
General Interactive Small-Step Algorithms
In earlier work, the Abstract State Machine Thesis — that arbitrary algorithms are behaviorally equivalent to abstract state machines — was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. Here we extend the axiomatization and the proof to cover interactive...
متن کاملAbstract State Machines: An Overview of the Project
State Machines: An Overview of the Project Yuri Gurevich Microsoft Research, One Microsoft Way, Redmond, WA 98052
متن کاملA Dialogue with Yuri Gurevich about Mathematics , Computer Science and Life ∗
Yuri Gurevich is well-known to the readers of this Bulletin. He is a Principal Researcher at Microsoft Research, where he founded a group on Foundations of Software Engineering, and a Professor Emeritus at the University of Michigan. His name is most closely associated with abstract state machines but he is known also for his work in logic, complexity theory and software engineering. The Gurevi...
متن کاملAbstract Hilbertian deductive systems, infon logic, and Datalog
Hilbertian Deductive Systems, Infon Logic, and Datalog Andreas Blassa,1,∗, Yuri Gurevich aMathematics Department, University of Michigan, Ann Arbor, MI 48109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA
متن کاملInteractive Algorithms 2005 with Added Appendix
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choice. Similarly, an object-oriented program cannot create a new object all by itself; a create-a-new-object command solicits outside help. These are but two examples of intrastep interaction of an algorithm with its envir...
متن کامل